Projection Techniques for Iterative Solution of Ax = B with Successive Right-hand Sides

نویسنده

  • Paul F. Fischer
چکیده

Projection techniques are developed for computing approximate solutions to linear systems of the form Ax n = b n , for a sequence n = 1; 2; :::, e.g., arising from time discretization of a partial diierential equation. The approximate solutions are based upon previous solutions, and can be used as initial guesses for iterative solution of the system, resulting in signiicantly reduced computational expense. Examples of two-and three-dimensional incompressible Navier-Stokes calculations are presented in which x n represents the pressure at time level t n , and A is a consistent discrete Poisson operator. In ows containing signiicant dynamic activity, these projection techniques lead to as much as a twofold reduction in solution time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

On recycling Krylov subspaces for solving linear systems with successive right-hand sides with applications in model reduction

by iterative methods based on recycling Krylov subspaces. We propose two recycling algorithms, which are both based on the generalized conjugate residual (GCR) method. The recycling methods reuse the descent vectors computed while solving the previous linear systems Ax = bj , j = 1, 2, . . . , i − 1, such that a lot of computational work can be saved when solving the current system Ax = bi. Whe...

متن کامل

Recycling Krylov Subspaces for Solving Linear Systems with Successively Changing Right-Hand Sides Arising in Model Reduction

We discuss the numerical solution of successive linear systems of equations Ax = bi, i = 1,2, . . .m, by iterative methods based on recycling Krylov subspaces. We propose various recycling algorithms which are based on the generalized conjugate residual (GCR) method. The recycling algorithms reuse the descent vectors computed while solving the previous linear systems Ax = b j, j = 1,2, . . . , ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993